Connectionist Learning Procedures

نویسنده

  • Geoffrey E. Hinton
چکیده

A major goal of research on networks of neuron-like processing units is to discover efficient learning procedures that allow these networks to construct complex internal representations of their environment. The learning procedures must be capable of modifying the connection strengths in such a way that internal units which are not part of the input or output come to represent important features of the task domain. Several interesting gradient-descent procedures have recently been discovered. Each connection computes the derivative, with respect to the connection strength, of a global measure of the error in the performance of the network. The strength is then adjusted in the direction that decreases the error. These relatively simple, gradient-descent learning procedures work well for small tasks and the new challenge is to find ways of improving their convergence rate and their generalization abilities so that they can be applied to larger, more realistic tasks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utilizing Connectionist Learning Procedures in Symbolic Case Retrieval Nets

This paper describes a method which, under certain circumstances, allows to automatically learn or adjust similarity measures. For this, ideas of connectionist learning procedures, in particular those related to Hebbian learning, are combined with a Case-Based Reasoning engine.

متن کامل

Connectionist Learning of Belief Networks

Neal, R.M., Connectionist learning of belief networks, Artificial Intelligence 56 (1992) 71-113. Connectionist learning procedures are presented for "sigmoid" and "noisy-OR" varieties of probabilistic belief networks. These networks have previously been seen primarily as a means of representing knowledge derived from experts. Here it is shown that the "Gibbs sampling" simulation procedure for s...

متن کامل

Connectionist ’viterbi Training: a New Hybrid Method for Continuous Speech Recognition

these procedures are well suited to speech recognition applications, in which Hybrid methods which combine hidden Markov models (HMMs) and connectionist techniques take advantage of what are. believed to be the strong points of each of the two approaches: the powerful discrimination-based learning of connectionist networks and the time-alignment capability of HMMs. Connectionist Viterbi Trainin...

متن کامل

When Pseudowords Become Words - Effects of Learning on Orthographic Similarity Priming

This paper investigates empirical predictions of a connectionist model of word learning. The model predicts that, although the mapping between word form and meaning is arbitrary (thus rendering words as being symbols in the semiotic sense), novel pseudowords will be able to prime the concepts corresponding to word forms that are orthographically similar. If, however, pseudowords acquire meaning...

متن کامل

A General Feed-Forward Algorithm for Gradient Descent in Connectionist Networks

An extended feed-forward algorithm for recurrent connectionist networks is presented. This algorithm, which works locally in time, is derived both for discrete-in-time networks and for continuous networks. Several standard gradient descent algorithms for connectionist networks (e.g. [48], [30], [28] [15], [34]), especially the backpropagation algorithm [36], are mathematically derived as a spec...

متن کامل

Connectionist models of recognition memory: constraints imposed by learning and forgetting functions.

Multilayer connectionist models of memory based on the encoder model using the backpropagation learning rule are evaluated. The models are applied to standard recognition memory procedures in which items are studied sequentially and then tested for retention. Sequential learning in these models leads to 2 major problems. First, well-learned information is forgotten rapidly as new information is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 40  شماره 

صفحات  -

تاریخ انتشار 1989